Replacement Attack on Arbitrary Watermarking Systems
نویسندگان
چکیده
Billions of dollars allegedly lost to piracy of multimedia have recently triggered the industry to rethink the way music and movies are distributed. As encryption is vulnerable to re-recording, currently all copyright protection mechanisms tend to rely on watermarking. A watermark is an imperceptive secret hidden into a host signal. In this paper, we analyze the security of multimedia copyright protection systems that use watermarks by proposing a new breed of attacks on generic watermarking systems. A typical replacement attack relies upon the observation that multimedia content is often highly repetitive. Thus, the attack procedure replaces each signal block with another, perceptually similar block computed as a combination of other similar blocks found either within the same media clip or within a library of media clips. Assuming the blocks used to compute the replacement are marked with distinct secrets, we show that if the computed replacement block is at some minimal distance from the original marked block, large portion of the embedded watermark is irreversibly removed. We describe the logistics of the attack and an exemplary implementation against a spread-spectrum data hiding technology for audio signals.
منابع مشابه
Analysis and Improving the Security of the Scalar Costa Scheme against Known Message Attack
Unintentional attacks on watermarking schemes lead to degrade the watermarking channel, while intentional attacks try to access the watermarking channel. Therefore, watermarking schemes should be robust and secure against unintentional and intentional attacks respectively. Usual security attack on watermarking schemes is the Known Message Attack (KMA). Most popular watermarking scheme with stru...
متن کاملClosed-Form Formulas for Private Watermarking Capacities of Laplacian Sources with the Magnitude-Error Distortion Measure and Under Additive Attacks
Calculation of watermarking capacities of private Laplacian watermarking systems with the magnitude-error distortion measure under fixed attacks is addressed. First, in the case of an additive Laplacian attack, a nice closed-form formula for the watermarking capacities is derived, which involves only the distortion level and the parameter of the Laplacian attack. Second, in the case of an arbit...
متن کاملHow to Combat Block Replacement Attacks?
Block replacement attacks consist in exploiting the redundancy of the host signal to replace each signal block with another one or a combination of other ones. Such an attacking strategy has been recognized to be a major threat against watermarking systems e.g. additive spread-spectrum and quantization index modulation algorithms. In this paper, a novel embedding strategy will be introduced to ...
متن کاملRobust Reversible Watermarking For Geometric Attack by Proposed Pixel Replacement Method
Volume 2, Issue 1 January February 2013 Page 186 Abstract: Reversible watermarking is broadly used in military and medical applications. In this paper we are presenting a novel pixel replacement method, whose watermark is robust to geometric attack as well as it has maximum embedding capacity than all histogram shifting methods. This idea is generated from histogram shifting method, a well know...
متن کاملSequential Detection of Deception Attacks in Networked Control Systems with Watermarking
In this paper, we investigate the role of a physical watermarking signal in quickest detection of a deception attack in a scalar linear control system where the sensor measurements can be replaced by an arbitrary stationary signal generated by an attacker. By adding a random watermarking signal to the control action, the controller designs a sequential test based on a Cumulative Sum (CUSUM) met...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002